Application of Fuzzy Graph Coloring in Traffic Light Problem
نویسنده
چکیده
Let G= (V,E,σ,μ) be a simple connected undirected fuzzy graph. In this paper, we use a fuzzy graph model to represent a traffic network of a city and discuss a method to find the different type of accidental zones in a traffic flows. This paper is based on fuzzy coloring of fuzzy graphs and fuzziness of vertices. Using this approach, we can minimize the total waiting time of a traffic flow. It will help to reduce the traffic jam of a road.
منابع مشابه
Just chromatic exellence in fuzzy graphs
A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...
متن کاملFuzzy Graph Coloring Technique to Classify the Accidental Zone of a Traffic Control
Let G= (V,E,σ,μ) be a simple connected undirected fuzzy graph. In this paper, we use a fuzzy graph model to represent a traffic network of a city and discuss a method to find the different type of accidental zones in a traffic flows. Depending on the possibility of accident, this paper classifies accidental zone of a traffic flow into three type’s namely α-strong, β-strong and δ-strong accident...
متن کاملSpectrum Assignment in Cognitive Radio Networks Using Fuzzy Logic Empowered Ants
The prevalent communications networks suffer from lack of spectrum and spectrum inefficiency. This has motivated researchers to develop cognitive radio (CR) as a smart and dynamic radio access promised solution. A major challenge to this new technology is how to make fair assignment of available spectrum to unlicensed users, particularly for smart grids communication. This paper introduces an i...
متن کاملAn Optimal Dynamic Control Method for an Isolated Intersection Using Fuzzy Systems
Traffic flow systems are nonlinear and uncertain, so it is very difficult to find their optimal points. In traditional traffic control systems, the traffic lights of crossings change in a fixed time period that is not optimal. On the other hand, most proposed systems are sufficiently capable of coping with the uncertainties of traffic flow. To solve this problem, there is a need to develop expe...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کامل